Refined Finiteness and Degree Properties in Graphs
نویسندگان
چکیده
منابع مشابه
A Refined Complexity Analysis of Degree Anonymization in Graphs
Motivated by a strongly growing interest in graph anonymization, we study the NP-hard Degree Anonymity problem asking whether a graph can be made k-anonymous by adding at most a given number of edges. Herein, a graph is k-anonymous if for every vertex in the graph there are at least k−1 other vertices of the same degree. Our algorithmic results shed light on the performance quality of a popular...
متن کاملFiniteness spaces, graphs and "coherence"
We look at a sub-collection of finiteness spaces introduced in [2] based on the notion of coherence spaces from [4]. The original idea was to generalize the notion of stable functions between coherence spaces to interpret the algebraic lambda-calculus ([6]) or even the differential lambda-calculus ([3]). An important tool for this analysis is the infinite Ramsey theorem. 0. Introduction. The ca...
متن کاملFiniteness of Disjoint Minimal Graphs
of u in R is called a minimal graph supported on Ω. In a recent article of Meeks-Rosenberg [M-R], where they proved the unicity of the helicoid, the authors showed that if the defining functions {ui} of a set of disjointly supported minimal graphs {Gi} have bounded gradients, then the number of graphs must be finite. In a private communication with the first author, Rosenberg posed the question...
متن کاملA refined algorithm for maximum independent set in degree-4 graphs
The maximum independent set problem is one of the most important problems in worstcase analysis for exact algorithms. Improvement on this problem in low-degree graphs can be used to get improvement on the problem in general graphs. In this paper, we show that the maximum independent set problem in an n-vertex graph with degree bounded by 4 can be solved in O∗(1.1376n) time and polynomial space,...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2020
ISSN: 1898-9934,1426-2630
DOI: 10.2478/forma-2020-0013